Simulation Study of the Performance of the Viterbi Decoding Algorithm for Certainm-level Line Codes
نویسنده
چکیده
In this paper we study the performance of different classes of M-level line codes under the Viterbi decoding algorithm. Some of the presented M-level line codes inherited the state machine structure by using the technique of distance mappings which preserve the properties of binary convolutional codes. Other M-level line codes were enforced to have the state machine structure to make use of the Viterbi decoding algorithm. The technique of spectral shaping was combined with distance mappings to generate spectral null distance mappings (SNDM)M-level line codes. The 2-dB gain between soft and hard decisions decoding for the different classes of M-level line codes is investigated. The standard technique for assessing the stability and the accuracy of any decoding algorithm, which is the error propagation is used to analyze the stability and the accuracy of the Viterbi decoding algorithm of the M-level line codes. The obtained results have shown advantages and outperformance of SNDM codes compared to the rest of line codes presented in this paper.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملTwo decoding algorithms for tailbiting codes
This paper presents two efficient Viterbi decoding-based suboptimal algorithms for tailbiting codes. The first algorithm, called the wrap-around Viterbi algorithm (WAVA), falls into the circular decoding category. It processes the tailbiting trellis iteratively, explores the initial state of the transmitted sequence through continuous Viterbi decoding, and improves the decoding decision with it...
متن کاملA convolutional single-parity-check concatenated coding scheme for high-data-rate applications
Absfmcf-The paper describes the possible implementation of concatenated coding scheme suitable particularly for high date rate applications. The proposed coding scheme uses a set of n convolutional codes multiplexed into an inner code and a (n, n 1) single-parity-check code serving as the outer code. Each of the inner convolutional codes is decoded independently with maximum-likelihood decoding...
متن کاملSOVA Based on a Sectionalized Trellis of Linear Block Codes
The use of block codes is a well known error-control technique for reliable transmission of digital information over noisy communication channels. However, a practically implementable softinput soft-output (SISO) decoding algorithm for block codes is still a challenging problem. This thesis examines a new decoding scheme based on the soft-output Viterbi algorithm (SOVA) applied to a sectionaliz...
متن کامل